Computational Complexity and Induction for Partial Computable Functions in Type Theory
نویسندگان
چکیده
An adequate theory of partial computable functions should provide a basis for deening computational complexity measures and should justify the principle of computational induction for reasoning about programs on the basis of their recursive calls. There is no practical account of these notions in type theory, and consequently such concepts are not available in applications of type theory where they are greatly needed. It is also not clear how to provide a practical and adequate account in programming logics based on set theory. This paper provides a practical theory supporting all these concepts in the setting of constructive type theories. We rst introduce an extensional theory of partial computable functions in type theory. We then add support for intensional reasoning about programs by explicitly re-ecting the essential properties of the underlying computation system. We use the resulting intensional reasoning tools to justify computational induction and to deene computational complexity classes. Complexity classes take the form of complexity-constrained function types. These function types are also used in conjunction with the propositions-as-types principle to deene a resource-bounded logic in which proofs of existence can guarantee feasibility of construction.
منابع مشابه
Basic algorithms in computational geometry with imprecise input
The domain-theoretic model of computational geometry provides us with continuous and computable predicates and binary operations. It can also be used to generalise the theory of computability for real numbers and real functions into geometric objects and geometric operations. A geometric object is computable if it is the effective limit of a sequence of finitary partial objects of the same type...
متن کاملFuzzy type theory with partial functions
This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...
متن کاملProbabilistic Recursion Theory and Implicit Computational Complexity (Long Version)
We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene’s partial recursive functions. The obtained algebra, following Leivant, can be restricted so as to capture the notion of polytime sampleable distributions, a key concept in average-cas...
متن کاملNotes on space complexity of integration of computable real functions in Ko-Friedman model
In the present paper it is shown that real function g(x) = x 0 f (t)dt is a linear-space computable real function on interval [0, 1] if f is a linear-space computable C 2 [0, 1] real function on interval [0, 1], and this result does not depend on any open question in the computational complexity theory. The time complexity of computable real functions and integration of computable real function...
متن کاملProbabilistic Recursion Theory and Implicit Computational Complexity
In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene’s partial re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999